Optimal distributed t-resilient election in complete networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Distributed t-Resilient Election in Complete Networks

We study the problem of distributed leader election in an asynchronous complete network, in presence of faults that occurred prior to the execution of the election algorithm. Failures of this type are encountered, for example, during a recovery from a crash in the network. For a network with n processors, k of which start the algorithm and at most t of which might he faulty, we present an algor...

متن کامل

Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks

We consider the problem of leader election in asynchronous oriented N-node complete networks. We present a leader election algorithm with O(N) message and O(log log N) time complexity. The message complexity is optimal and the time complexity is the best possible under the assumption of message optimality. The best previous leader election algorithm for asynchronous oriented complete networks b...

متن کامل

Optimal Distributed Generation Planning in Radial Distribution Networks Considering Protection Coordination Limits

Distributed generation (DG) has been widely used in distribution network to reduce the energy losses, improve voltage profile and system reliability, etc.  The location and capacity of DG units can influence on probability of protection mal-operation in distribution networks. In this paper, a novel model for DG planning is proposed to find the optimum DG location and sizing in radial distr...

متن کامل

Optimal Distributed Generation (DG) Allocation in Distribution Networks using an Improved Ant Colony Optimization (ACO) Algorithm

Abstract: The development of distributed generation (DGs) units in recent years have created challenges in the operation of power grids, especially distribution networks. One of these issues is the optimal allocation (location and capacity) of these units in distribution networks. In this thesis, a method based on the improved ant colony optimization algorithm is presented to solve the problem ...

متن کامل

Optimal Placement and Sizing of Distributed Generations in Unbalanced Distribution Networks Considering Load Models and Uncertainties

Development of distributed generations’ technology, trends in the use of these sources to improve some of the problems such as high losses, low reliability, low power quality and high costs in distributed networks. Choose the correct location to install and proper capacity of these sources, such as important things that must be considered in their use. Since distribution networks are actu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Software Engineering

سال: 1990

ISSN: 0098-5589

DOI: 10.1109/32.54293